2

How bad is selfish routing?

Year:
2002
Language:
english
File:
PDF, 331 KB
english, 2002
3

The Quickest Transshipment Problem

Year:
2000
Language:
english
File:
PDF, 1009 KB
english, 2000
5

An application of submodular flows

Year:
1989
Language:
english
File:
PDF, 1.27 MB
english, 1989
6

Bounding the inefficiency of equilibria in nonatomic congestion games

Year:
2004
Language:
english
File:
PDF, 225 KB
english, 2004
11

Polynomial dual network simplex algorithms

Year:
1993
Language:
english
File:
PDF, 1.45 MB
english, 1993
12

An approximation algorithm for the generalized assignment problem

Year:
1993
Language:
english
File:
PDF, 898 KB
english, 1993
13

Generalized polymatroids and submodular flows

Year:
1988
Language:
english
File:
PDF, 3.62 MB
english, 1988
14

Trading networks with price-setting agents

Year:
2009
Language:
english
File:
PDF, 263 KB
english, 2009
16

The Quickest Transshipment Problem

Year:
2000
Language:
english
File:
PDF, 347 KB
english, 2000
20

Notes from the EC'13 program chairs

Year:
2013
Language:
english
File:
PDF, 155 KB
english, 2013
22

Invited Article Foreword

Year:
2018
File:
PDF, 24 KB
2018
23

Algorithms for a network design problem with crossing supermodular demands

Year:
2004
Language:
english
File:
PDF, 186 KB
english, 2004
25

Approximation Algorithms for Steiner and Directed Multicuts

Year:
1997
Language:
english
File:
PDF, 277 KB
english, 1997
26

Editor's Foreword

Year:
1998
File:
PDF, 38 KB
1998
28

Fairness in Routing and Load Balancing

Year:
2001
Language:
english
File:
PDF, 177 KB
english, 2001
30

An intersection theorem for supermatroids

Year:
1990
Language:
english
File:
PDF, 567 KB
english, 1990
31

Algorithms for routing around a rectangle

Year:
1992
Language:
english
File:
PDF, 1.09 MB
english, 1992
32

Using separation algorithms in fixed dimension

Year:
1992
Language:
english
File:
PDF, 1.25 MB
english, 1992
33

A faster parametric minimum-cut algorithm

Year:
1994
Language:
english
File:
PDF, 842 KB
english, 1994
34

Improved bounds on the max-flow min-cut ratio for multicommodity flows

Year:
1995
Language:
english
File:
PDF, 671 KB
english, 1995
35

Approximation algorithms for scheduling unrelated parallel machines

Year:
1990
Language:
english
File:
PDF, 751 KB
english, 1990
36

An application of simultaneous diophantine approximation in combinatorial optimization

Year:
1987
Language:
english
File:
PDF, 907 KB
english, 1987
37

A strongly polynomial minimum cost circulation algorithm

Year:
1985
Language:
english
File:
PDF, 459 KB
english, 1985
38

A network pricing game for selfish traffic

Year:
2007
Language:
english
File:
PDF, 275 KB
english, 2007
39

Load balancing without regret in the bulletin board model

Year:
2011
Language:
english
File:
PDF, 183 KB
english, 2011
40

Cost-Sharing Mechanisms for Network Design

Year:
2008
Language:
english
File:
PDF, 505 KB
english, 2008
43

Note on Weintraub’s Minimum-Cost Circulation Algorithm

Year:
1989
Language:
english
File:
PDF, 626 KB
english, 1989
45

Allocating Bandwidth for Bursty Connections

Year:
2000
Language:
english
File:
PDF, 278 KB
english, 2000
47

Special Issue on Foundations of Computer Science

Year:
2008
Language:
english
File:
PDF, 31 KB
english, 2008